LTL Is Expressively Complete for Mazurkiewicz Traces

نویسندگان

  • Volker Diekert
  • Paul Gastin
چکیده

A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (Linear Temporal Logic) is expressively complete with respect to the first order theory. We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they were all weaker, since they used additional past or future modalities. Another feature of our work is that our proof is direct and does not use any reduction to the word case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces

To obtain an expressively complete linear-time temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalities, in contrast to the classical setting of LTL over sequences. Earlier attempts at defining expressively ...

متن کامل

An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces

A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the co...

متن کامل

Dagstuhl Seminar on Logic, Algebra, and Formal Verification of Concurrent Systems

s of the Talks 6 Pascal Weil Recognizability and regularity for languages of series-parallel pomsets . . . . . . . . . . . . . 6 Lenore Zuck Automatic Deductive Verification with Invisible Invariants . . 7 Manfred Droste Process Cost Functions for Concurrent Systems . . . . . . . . 7 Doron Peled Black Box Checking . . . . . . . . . . . . . . . . . . . . . . . . 8 Rémi Morin On Rational Message ...

متن کامل

Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces

The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively complete. The analogous result with a global interpretation was solved some years ago by Thiagarajan and Walukiewicz (1997) and in its final form without any reference to past tense constants by Diekert and Gastin (2000)....

متن کامل

Deciding LTL over Mazurkiewicz Traces

Linear time temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to und...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2000